Will SCIENCE be stronger than POLITICS?

Will C + + be faster than Fortran ? Todd

After years of being dismissed as too slow for scientiic computing , C++ has caught up with Fortran and appears ready to give it stii competition. We survey the reasons for the historically poor performance of C++ (pairwise expression evaluation, the abstraction penalty, aliasing ambiguities) and explain how these problems have been resolved. C++ can be faster than Fortran for some applications...

This number will be updated

Harris's lopsidependency criterion can be stronger than Shearer's criterion

The Lopsided Lovász Local Lemma (LLLL) is a probabilistic tool which is a cornerstone of the probabilistic method of combinatorics, which shows that it is possible to avoid a collection of “bad” events as long as their probabilities and interdependencies are sufficiently small. The strongest possible criterion that can be stated in these terms is due to Shearer (1985), although it is technicall...

Would Diamond Nanorods Be Stronger than Fullerene Nanotubes?

On the basis of literature ab initio data, we show that diamond nanorods would have a brittle fracture force and a zero strain stiffness that exceeds carbon nanotubes for radii greater than about 1−3 nm, depending on the orientation of the diamond nanorod. The energetic stability of diamond nanorods is predicted by molecular modeling to be comparable to single-walled carbon nanotubes. It is con...

Stronger-Than-Quantum Correlations

After an elementary derivation of Bell’ s inequality, classical, quantum mechanical , and stronger-than-quantum correlation functions for 2-particle-systems are discussed. Special functions are investigated which give rise to an extreme violation of Bell’ s inequality by the value of 4. Referring to a specific quantum system it is shown that under certain conditions such an extreme violation wo...